When the “ exact ” discrete gradient is not the best choice in optimal shape design ?
نویسندگان
چکیده
In aerodynamics, Optimal Shape Design (OSD) aims to find the minimum of an objective function describing an aerodynamic property, by controlling the Partial Differential Equation (PDE) modeling the dynamics of the flow that surrounds an aircraft. The objective function minimization is usually achieved by means of an iterative process which requires the computation of the gradients of the cost function with respect to the design variables. Gradients can be computed in a variety of ways but, to the best of our knowledge, the most efficient method to compute the cost function gradient is the so-called “adjoint method”. At the computational level there are two approaches to the adjoint system: the continuous method and the discrete one. In the continuous approach, the adjoint equations are derived from the flow equations and then subsequently discretized (continuous adjoint methodology ), whereas in the discrete approach the adjoint equations are directly derived from the discretized governing equations (discrete adjoint, automatic differentiation, finite differences or complex step methodologies). In the aeronautical practice, the target is to minimize a discrete objective function and, consequently, the “discrete approach” seems to be more “natural”. However, as shown in this paper, there are relevant situations (strong shock waves or wrong numerical grid orientation) in which the gradient obtained using a discrete approach shows a non-physical oscillatory behavior. In those cases, the discrete objective function (at the smallest scales) fails to capture the behavior of the continuous objective function and, consequently, the discrete approach to compute the objective function gradient could be inappropriate. In this article, we will analyze the origin of the aforementioned numerical oscillations in different systems (Burgers’ equation, quasi 1D Euler’s equations and 2D Euler’s equations). Some numerical experiments will be shown and their impact on the optimization process will be explained. Finally some conclusions and further recommendation will be presented.
منابع مشابه
On Rank-Ordered Nested Multinomial Logit Model and D-Optimal Design for this Model
In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...
متن کاملSIZING OPTIMIZATION OF TRUSS STRUCTURES WITH NEWTON META-HEURISTIC ALGORITHM
This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...
متن کاملISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES USING LEVEL SET METHOD INCORPORATING SENSITIVITY ANALYSIS
This study focuses on the topology optimization of structures using a hybrid of level set method (LSM) incorporating sensitivity analysis and isogeometric analysis (IGA). First, the topology optimization problem is formulated using the LSM based on the shape gradient. The shape gradient easily handles boundary propagation with topological changes. In the LSM, the topological gradient method as ...
متن کاملNon-homogeneous continuous and discrete gradient systems: the quasi-convex case
In this paper, first we study the weak and strong convergence of solutions to the following first order nonhomogeneous gradient system $$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\x(0)=x_0in Hend{cases}$$ to a critical point of $phi$, where $phi$ is a $C^1$ quasi-convex function on a real Hilbert space $H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010